Fast Projection Pursuit Based on Quality of Projected Clusters

نویسندگان

  • Marek Grochowski
  • Wlodzislaw Duch
چکیده

Projection pursuit index measuring quality of projected clusters (QPC) introduced recently optimizes projection directions by minimizing leave-one-out error searching for pure localized clusters. QPC index has been used in constructive neural networks to discover non-local clusters in high-dimensional multiclass data, reduce dimensionality, aggregate features, visualize and classify data. However, for n training instances such optimization requires O(n) calculations. Fast approximate version of QPC introduced here obtains results of similar quality with O(n) effort, as illustrated in a number of classification and data visualization problems.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Projection Pursuit Constructive Neural Networks Based on Quality of Projected Clusters

Linear projection pursuit index measuring quality of projected clusters (QPC) is used to discover non-local clusters in high-dimensional multiclass data, reduction of dimensionality, feature selection, visualization of data and classification. Constructive neural networks that optimize the QPC index are able to discover simplest models of complex data, solving problems that standard networks ba...

متن کامل

Functional Projection Pursuit

This article describes the adaption of exploratory projection pursuit for use with functional data. The aim is to nd \interesting" projections of functional data: e.g. to separate curves into meaningful clusters. Functional data are projected onto low-dimensional subspaces determined by a projection function using a suitable inner product. Such a projection is rapidly computed by representing d...

متن کامل

Fast System Matrix Calculation in CT Iterative Reconstruction

Introduction: Iterative reconstruction techniques provide better image quality and have the potential for reconstructions with lower imaging dose than classical methods in computed tomography (CT). However, the computational speed is major concern for these iterative techniques. The system matrix calculation during the forward- and back projection is one of the most time- cons...

متن کامل

انجام یک مرحله پیش پردازش قبل از مرحله استخراج ویژگی در طبقه بندی داده های تصاویر ابر طیفی

Hyperspectral data potentially contain more information than multispectral data because of their higher spectral resolution. However, the stochastic data analysis approaches that have been successfully applied to multispectral data are not as effective for hyperspectral data as well. Various investigations indicate that the key problem that causes poor performance in the stochastic approaches t...

متن کامل

A Fast Algorithm for Finding Correlation Clusters in Noise Data

Noise significantly affects cluster quality. Conventional clustering methods hardly detect clusters in a data set containing a large amount of noise. Projected clustering sheds light on identifying correlation clusters in such a data set. In order to exclude noise points which are usually scattered in a subspace, data points are projected to form dense areas in the subspace that are regarded as...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2011